Dualities for Constraint Satisfaction Problems
نویسندگان
چکیده
In a nutshell, a duality for a constraint satisfaction problem equates the existence of one homomorphism to the non-existence of other homomorphisms. In this survey paper, we give an overview of logical, combinatorial, and algebraic aspects of the following forms of duality for constraint satisfaction problems: finite duality, bounded pathwidth duality, and bounded treewidth duality.
منابع مشابه
Dualities in full homomorphisms
In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edgeand non-edge-preserving. The research was motivated, a.o., by results from logic (concerning first order definability) and Constraint Satisfaction Problems. We prove that for any finite set of objects B (finite relational structures) there...
متن کاملTwo new homomorphism dualities and lattice operations
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems that are definable in the smallest natural recursive fragment of Datalog monadic linear Datalog with at most one EDB per rule, and also in the smallest non-linear extension of this fragment. We give combinatorial and al...
متن کاملCSP duality and trees of bounded pathwidth
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of homomorphism dualities involving trees of bounded pathwidth and in algebraic terms. For this, we introduce a new parameter for trees that closely approximates pathwidth and can be characterised via a hypergraph searchin...
متن کاملMany Facets of Dualities
In this paper we survey results related to homomorphism dualities for graphs, and more generally, for finite structures. This is related to some of the classical combinatorial problems, such as colorings of graphs and hypergraphs, and also to recently intensively studied Constraint Satisfaction Problems. On the other side dualities are related to the descriptive complexity and First Order defin...
متن کاملUniversal Structures and the Logic of Forbidden Patterns
We show that forbidden patterns problems, when restricted to some classes of input structures, are in fact constraint satisfaction problems. This contrasts with the case of unrestricted input structures, for which it is known that there are forbidden patterns problems that are not constraint satisfaction problems. We show that if the input comes from a class of connected structures with low tre...
متن کامل